Veriication of Linear Hybrid Action Systems

Action Systems is a predicate transformer based formalism for the devel opment of reactive and distributed systems by re nement Lately Action Systems was extended with a di erential action that models continuous be haviour Such action systems capture hybrid systems where a discrete con troller interacts with some continuously evolving environment Recently we investigated a class of Action Systems called Linear Hybrid Action Systems that capture linear hybrid systems These action systems can formally be translated to linear hybrid automata for which there exists tools for automated analysis e g HyTech However since Linear Hybrid Action Systems is a strict subclass of linear hybrid automata the translation necessarily introduces more complexity to the model making the analysis harder Therefore the contribution of this paper is to propose two e cient complementary semi decision algorithms for the analysis of Linear Hybrid Action Systems an invariant veri cation algorithm of linear complexity and a reachability algorithm of squared complexity